Isometric bending requires local constraints on free edges

Graph packing with constraints on edges

A graph consists of a set of vertices (nodes) and a set of edges (line connecting vertices). Two graphs pack when they have the same number of vertices and we can put them in the same vertex set without overlapping edges. Studies such as Sauer and Spencer [7], Bollobás and Eldridge [1], Kostochka and Yu [6], have shown sufficient conditions, specifically relations between number of edges in the...

Election and Local Computations on Edges

DNA length, bending, and twisting constraints on IS50 transposition.

Transposition is a multistep process in which a transposable element DNA sequence moves from its original genetic location to a new site. Early steps in this process include the formation of a transposition complex in which the end sequences of the transposable element are brought together in a structurally precise fashion through the action of the element-encoded transposase protein and the cl...

Graph matching with type constraints on nodes and edges

In this paper, we consider two particular problems of directed graph matching. The first problem concerns graphs with nodes that have been subdivided into classes of different type. The second problem treats graphs with edges of different types. In the two cases, the matching process is based on a constrained projection of the nodes and of the edges of both graphs in a lower dimensional space. ...

Total Variation Based Image Restoration with Free Local Constraints

The two main plagues of image restoration are oscillations and smoothing. Traditional image restoration techniques prevent parasitic oscillations by resorting to smooth regularization. Hence, singular image features and oscillatory textures cannot be restored. The usefulness of images obtained by smooth regularization is very limited. Regularized faces and characters lose features and are unrec...